Mso Deenable Text Languages ?
نویسنده
چکیده
A text is a word together with an (additional) linear ordering. Each text has a generic tree representation, called its shape. We consider texts in a logical and an algebraic framework, and we prove that the classes of monadic second order deenable and of recognizable text languages coincide. In particular we demonstrate that the construction of the shape of a text can be formalized in terms of our monadic second-order logic. We brieey consider right-linear grammars for texts.
منابع مشابه
Characterization of Properties and Relations Deened in Monadic Second Order Logic on the Nodes of Trees
A formula from monadic second order (mso) logic with one free variable can be used to deene a property of the nodes of a tree. Similarly, an mso formula with two free variables can be used to deene a binary relation between the nodes of a tree. It is proved that a node relation is mso deenable ii it can be computed by a nite-state tree-walking automaton, provided the automaton can test mso deen...
متن کاملMso Deenable String Transductions and Two-way Nite State Transducers
String transductions that are deenable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way nite state transducers. Nondetermin-istic mso deenable string transductions (i.e., those deenable with the use of parameters) corespond to compositions of two nondeterministic two-way nite state transducers that have the nite visit proper...
متن کاملCharacterizing and Deciding Mso-deenability of Macro Tree Transductions ?
A macro tree transduction is MSO deenable if and only if it is of linear size increase. Furthermore, it is decidable for a macro tree transduction whether or not it is MSO deenable.
متن کاملTree Languages Generated be Context-Free Graph Grammars
A characterization is given of the class of tree languages which can be generated by context-free hyperedge replacement (HR) graph grammars, in terms of macro tree transducers (MTTs). A similar characterization is given of the MSO deenable tree transductions.
متن کاملA Comparison of Tree Transductionsde ned by Monadic Second Order
Formulas from monadic second order (mso) logic with one and two free variables can be used to deene the nodes and edges (respectively) of a graph, in terms of a given graph. Such mso deenable graph transductions play a role in the theory of graph grammars. Here we investigate the special case of trees. The main result is that the mso deenable tree transductions are exactly those tree transducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994